Max-flow min-cut theorem - PDFSEARCH.IO - Document Search Engine

Max-flow min-cut theorem
Results: 37

#	Item
21	Constructing Optimal Solutions to the Minimum Cost 2-edge-connected Spanning Subgraph Problem Sylvia Boyd Paul Elliott-Magwood Add to Reading List Source URL: www.fields.utoronto.ca Language: English - Date: 2006-04-28 12:37:31 Graph connectivity Ear decomposition Max-flow min-cut theorem Graph Cut Spanning tree Graph theory Mathematics Combinatorial optimization
22	MATHEMATICS OF OPERATIONS RESEARCH Vol. 35, No. 2, May 2010, pp. 479–493 issn 0364-765X eissn[removed] 10 3502 0479 informs Add to Reading List Source URL: mgoycool.uai.cl Language: English - Date: 2011-10-28 12:33:41 Combinatorial optimization Elementary algebra Inequality Linear programming Combinatory logic Max-flow min-cut theorem Mathematics Theoretical computer science Applied mathematics
23	CS787: Advanced Algorithms[removed]Lecture 5 addendum: LP Duality Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2009-09-26 00:08:11 Operations research Duality Combinatorial optimization Max-flow min-cut theorem Strong duality Constraint Maximum flow problem Semidefinite programming Mathematical optimization Convex optimization Linear programming
24	LIPIcs Leibniz International Proceedings in Informatics Iterative Methods in Combinatorial Optimization Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2009-12-08 10:54:24 Operations research Combinatorial optimization Linear programming Convex optimization Minimum spanning tree Travelling salesman problem Ellipsoid method Max-flow min-cut theorem Relaxation Mathematics Theoretical computer science Mathematical optimization
25	Abstract flows over time: A first step towards solving dynamic packing problems? Jan-Philipp W. Kappmeier, Jannik Matuschke, and Britta Peis TU Berlin, Institut f¨ ur Mathematik, Straße des 17. Juni 136, 10623 Berlin, Add to Reading List Source URL: www.redaktion.tu-berlin.de Language: English - Date: 2012-11-12 07:12:44 Combinatorics Maximum flow problem Flow network Dimensional analysis Fluid dynamics Cut Max-flow min-cut theorem Ford–Fulkerson algorithm Network flow Graph theory Mathematics
26	JN[removed]Flow in transport networks 2 3 Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2006-05-18 12:16:21 Combinatorics Maximum flow problem Flow network Max-flow min-cut theorem Cut Ford–Fulkerson algorithm Push-relabel maximum flow algorithm Network flow Graph theory Mathematics
27	Approximation and Hardness Results for Label Cut and Related Problems Peng Zhang ∗ Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2008-02-10 09:20:05 NP-complete problems Combinatorial optimization Maximum flow problem Graph coloring Cut Minimum k-cut Optimization problem Max-flow min-cut theorem Set cover problem Theoretical computer science Mathematics Graph theory
28	A normalization strategy for comparing tag count data Add to Reading List Source URL: www.ncbi.nlm.nih.gov Language: English Tree Connectivity Line graph Max-flow min-cut theorem Matching Path decomposition Planar separator theorem Graph theory Mathematics Spanning tree
29	An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations Jonathan A. Kelner Add to Reading List Source URL: math.mit.edu Language: English - Date: 2013-04-08 19:53:37 Operations research Combinatorial optimization Maximum flow problem Gradient descent Flow network Graph Max-flow min-cut theorem Lipschitz continuity Function Mathematics Numerical analysis Network flow
30	On the Separation of Channel and Network Coding in Aref Networks Niranjan Ratnakar Add to Reading List Source URL: www.ifp.illinois.edu Language: English - Date: 2005-06-29 17:06:05 Discrete mathematics Coding theory Information theory Wireless sensor network Finite fields Network coding Maximum flow problem Flow network Max-flow min-cut theorem Mathematics Network flow Graph theory

UPDATE